Application of Heuristic Combinations in Hyper-Heuristic Framework for Exam Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Novel Hyper-heuristic Approaches in Exam Timetabling
This thesis presents an investigation into the use of hyper-heuristic approaches to construct and improve solutions for exam timetabling problems. The majority of the approaches developed in the literature operate on a space of potential solutions to a problem. However, a hyper-heuristic is a heuristic which acts on a space of heuristics, rather than a solution space directly. The majority of r...
متن کاملA unified hyper-heuristic framework for solving bin packing problems
One-and two-dimensional packing and cutting problems occur in many commercial contexts, and it is often important to be able to get good-quality solutions quickly. Fairly simple deterministic heuristics are often used for this purpose, but such heuristics typically find excellent solutions for some problems and only mediocre ones for others. Trying several different heuristics on a problem adds...
متن کاملEvolution Hyper - heuristic for Combinatorial Optimization problems
Designing generic problem solvers that perform well across a diverse set of problems is a challenging task. In this work, we propose a hyper-heuristic framework to automatically generate an effective and generic solution method by utilizing grammatical evolution. In the proposed framework, grammatical evolution is used as an online solver builder, which takes several heuristic components (e.g. ...
متن کاملA study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
Research in the domain of examination timetabling is moving towards developing methods that generalise well over a range of problems. This is achieved by implementing hyper-heuristic systems to find the best heuristic or heuristic combination to allocate examinations when constructing a timetable for a problem. Heuristic combinations usually take the form of a list of low-level heuristics that ...
متن کاملA grouping hyper-heuristic framework: Application on graph colouring
Grouping problems are hard to solve combinatorial optimisation problems which require partitioning of objects into a minimum number of subsets while a given objective is simultaneously optimized. Selection hyper-heuristics are high level general purpose search methodologies that operate on a space formed by a set of low level heuristics rather than solutions. Most of the recently proposed selec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)
سال: 2020
ISSN: 2580-0760
DOI: 10.29207/resti.v4i4.2066